منابع مشابه
Kolmogorov complexity and cryptography
We consider (in the framework of algorithmic information theory) questions of the following type: construct a message that contains different amounts of information for recipients that have (or do not have) certain a priori information. Assume, for example, that the recipient knows some string a, and we want to send her some information that allows her to reconstruct some string b (using a). On...
متن کاملCompressibility and Kolmogorov Complexity
We continue the investigation of the path-connected geometry on the Cantor space and the related notions of dilution and compressibility described in [1]. These ideas are closely related to the notions of effective Hausdorff and packing dimensions of reals, and we argue that this geometry provides the natural context in which to study them. In particular we show that every regular real can be m...
متن کاملKolmogorov Complexity and Games
In this survey we consider some results on Kolmogorov complexity whose proofs are based on interesting games. The close relation between Recursion theory, whose part is Kolmogorov complexity, and Game theory was revealed by Andrey Muchnik. In [10], he associated with every statement φ of Recursion theory a game Gφ that has the following properties. First, Gφ is a game with complete information ...
متن کاملShannon Information and Kolmogorov Complexity
We compare the elementary theories of Shannon information and Kolmogorov complexity, the extent to which they have a common purpose, and where they are fundamentally different. We discuss and relate the basic notions of both theories: Shannon entropy versus Kolmogorov complexity, the relation of both to universal coding, Shannon mutual information versus Kolmogorov (‘algorithmic’) mutual inform...
متن کاملKolmogorov Complexity and Model Selection
The goal of statistics is to provide explanations (models) of observed data. We are given some data and have to infer a plausible probabilistic hypothesis explaining it. Consider, for example, the following scenario. We are given a “black box”. We have turned the box on (only once) and it has produced a sequence x of million bits. Given x, we have to infer a hypothesis about the black box. Clas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Steklov Institute of Mathematics
سال: 2011
ISSN: 0081-5438,1531-8605
DOI: 10.1134/s0081543811060125